Direct - Mapped Constrained Migration Problem
نویسندگان
چکیده
The constrained migration problem arises in the memory management of large multiprocessor systems. Given a network of processors, each of which has its own local memory, the purpose of this problem is to nd an e cient migration strategy which locates each writable page at an appropriate processor by migration to reduce the total access cost, while considering the actual capacity of each local memory. Although this problem is focused recently in the competitive analysis area for on-line algorithms, only a few results are known so far about this problem. This paper examines the on-line constrained migration problem deeper by attacking some special case of the problem which we named the direct-mapped constrained migration problem, where all processors are assumed to manage pages in their local memory using the same hash function. For the direct-mapped constrained migration problem we present an optimal 3-competitive deterministic on-line algorithm when the network consists of only 2 nodes. Furthermore we develop two O(1)-competitive on-line algorithms for uniform graphs which are either deterministic or memoryless. Interestingly this competitive ratio breaks the previous best upper bound obtained by applying known algorithms for the constrained migration problem to this problem. Observing this fact, we also give an important conjecture on the constrained migration problem. ANY OTHER IDENTIFYING INFORMATION OF THIS REPORT DISTRIBUTION STATEMENT First issue 35 copies. SUPPLEMENTARY NOTES Part of this work was done when the second author visited Max-Planck-Institut f ur Informatik, Saarbr ucken, Germany. REPORT DATE November 2, 1994 TOTAL NO. OF PAGES 19 WRITTEN LANGUAGE English NO. OF REFERENCES 14 DEPARTMENT OF INFORMATION SCIENCE Faculty of Science, University of Tokyo 7-3-1 Hongo, Bunkyo-ku, Tokyo 113, Japan Direct-Mapped Constrained Migration Problem Susanne Albers Max-Planck-Institut f ur Informatik Saarbr ucken, Germany [email protected] Hisashi Koga The University of Tokyo Tokyo, Japan [email protected]
منابع مشابه
A Cuckoo search algorithm (CSA) for Precedence Constrained Sequencing Problem (PCSP)
Precedence constrained sequencing problem (PCSP) is related to locate the optimal sequence with the shortest traveling time among all feasible sequences. In PCSP, precedence relations determine sequence of traveling between any two nodes. Various methods and algorithms for effectively solving the PCSP have been suggested. In this paper we propose a cuckoo search algorithm (CSA) for effectively ...
متن کاملOn the hybrid conjugate gradient method for solving fuzzy optimization problem
In this paper we consider a constrained optimization problem where the objectives are fuzzy functions (fuzzy-valued functions). Fuzzy constrained Optimization (FO) problem plays an important role in many fields, including mathematics, engineering, statistics and so on. In the other side, in the real situations, it is important to know how may obtain its numerical solution of a given interesting...
متن کاملThe Exact Solution of Min-Time Optimal Control Problem in Constrained LTI Systems: A State Transition Matrix Approach
In this paper, the min-time optimal control problem is mainly investigated in the linear time invariant (LTI) continuous-time control system with a constrained input. A high order dynamical LTI system is firstly considered for this purpose. Then the Pontryagin principle and some necessary optimality conditions have been simultaneously used to solve the optimal control problem. These optimality ...
متن کاملThe preemptive resource-constrained project scheduling problem subject to due dates and preemption penalties: An integer programming approach
Extensive research has been devoted to resource constrained project scheduling problem. However, little attention has been paid to problems where a certain time penalty must be incurred if activity preemption is allowed. In this paper, we consider the project scheduling problem of minimizing the total cost subject to resource constraints, earliness-tardiness penalties and preemption penalties, ...
متن کاملEfficient Strategy based on Improved Biogeography-based Algorithm for Inventory Routing problem
Researchers and urban administrators have often considered the routing problem as one of the fundamental phases in developing hazard management systems. In this research, a routing problem is investigated and analyzed by proposing an enhanced metaheuristic algorithm based on biogeography. In this problem, the production planning, inventory management, and distribution planning have been conside...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994